<HTML><HEAD><TITLE>Constraints</TITLE></HEAD><BODY>[ <A HREF="index.html">Reference Manual</A> | <A HREF="fullindex.html">Alphabetic Index</A> ]
<H1>Constraints</H1><DL>
<DT><A HREF="lib/bfs/index.html"><STRONG>bfs</STRONG></A></DT>
<DD>Best-first search library</DD>
<DT><A HREF="lib_public/cardinal/index.html"><STRONG>cardinal</STRONG></A></DT>
<DD>Finite Set Constraints Library</DD>
<DT><A HREF="lib/changeset/index.html"><STRONG>changeset</STRONG></A></DT>
<DD>Compute sets of modified variables</DD>
<DT><A HREF="lib/chr/index.html"><STRONG>chr</STRONG></A></DT>
<DD>Constraint Handling Rules Library - obsolescent, use library(ech) instead</DD>
<DT><A HREF="lib/colgen/index.html"><STRONG>colgen</STRONG></A></DT>
<DD>Column generation library</DD>
<DT><A HREF="lib/conjunto/index.html"><STRONG>conjunto</STRONG></A></DT>
<DD>Finite Set Constraints Library - obsolescent, use library(fd_sets) instead</DD>
<DT><A HREF="lib/conjunto_fd_sets/index.html"><STRONG>conjunto_fd_sets</STRONG></A></DT>
<DD>lib(conjunto) compatibility wrapper for lib(fd_sets)</DD>
<DT><A HREF="lib/constraint_pools/index.html"><STRONG>constraint_pools</STRONG></A></DT>
<DD>Support for the creation of constraint pools</DD>
<DT><A HREF="lib/cumulative/index.html"><STRONG>cumulative</STRONG></A></DT>
<DD>Cumulative scheduling constraint library for FD</DD>
<DT><A HREF="lib/ech/index.html"><STRONG>ech</STRONG></A></DT>
<DD>Extended constraint handling rules library</DD>
<DT><A HREF="lib/edge_finder/index.html"><STRONG>edge_finder</STRONG></A></DT>
<DD>Quadratic edge-finder algorithm for disjunctive and cumulative constraints for FD</DD>
<DT><A HREF="lib/edge_finder3/index.html"><STRONG>edge_finder3</STRONG></A></DT>
<DD>Cubic edge-finder algorithm for disjunctive and cumulative constraints for FD</DD>
<DT><A HREF="lib/eplex/index.html"><STRONG>eplex</STRONG></A></DT>
<DD>Interface to external Simplex or MIP solvers</DD>
<DT><A HREF="lib/eplex_cplex/index.html"><STRONG>eplex_cplex</STRONG></A></DT>
<DD>Load lib(eplex) with the CPLEX solver</DD>
<DT><A HREF="lib/eplex_osi/index.html"><STRONG>eplex_osi</STRONG></A></DT>
<DD>Load lib(eplex) with COIN-OR's OSI with a default solver</DD>
<DT><A HREF="lib/eplex_osi_clpcbc/index.html"><STRONG>eplex_osi_clpcbc</STRONG></A></DT>
<DD>Load lib(eplex) with COIN-OR's CLP (linear) with CBC (mixed integer) via OSI's OSIClpSolverInterface.</DD>
<DT><A HREF="lib/eplex_osi_symclp/index.html"><STRONG>eplex_osi_symclp</STRONG></A></DT>
<DD>Load lib(eplex) with COIN-OR's SYMPHONY (mixed integer) with CLP (linear) via OSI's OSISymSolverIterface.</DD>
<DT><A HREF="lib/eplex_xpress/index.html"><STRONG>eplex_xpress</STRONG></A></DT>
<DD>Load lib(eplex) with the XPRESS-MP solver</DD>
<DT><A HREF="lib/fd/index.html"><STRONG>fd</STRONG></A></DT>
<DD>Finite domain library</DD>
<DT><A HREF="lib/fd_global/index.html"><STRONG>fd_global</STRONG></A></DT>
<DD>Various global constraints over lists of FD variables</DD>
<DT><A HREF="lib/fd_sbds/index.html"><STRONG>fd_sbds</STRONG></A></DT>
<DD>Symmetry Breaking During Search (SBDS)</DD>
<DT><A HREF="lib/fd_search/index.html"><STRONG>fd_search</STRONG></A></DT>
<DD>This library contains a generic search routine which 
implements a number of partial search methods (complete, credit, lds, bbs, dbs)</DD>
<DT><A HREF="lib/fd_sets/index.html"><STRONG>fd_sets</STRONG></A></DT>
<DD>Solver over sets of integers (cooperates with lib(fd))</DD>
<DT><A HREF="lib_public/flatzinc/index.html"><STRONG>flatzinc</STRONG></A></DT>
<DD>Interpreter for FlatZinc</DD>
<DT><A HREF="lib_public/fzn_eplex/index.html"><STRONG>fzn_eplex</STRONG></A></DT>
<DD>Mapping from FlatZinc to lib(eplex)</DD>
<DT><A HREF="lib_public/fzn_fd/index.html"><STRONG>fzn_fd</STRONG></A></DT>
<DD>Mapping from FlatZinc to lib(fd) and lib(fd_sets)</DD>
<DT><A HREF="lib_public/fzn_ic/index.html"><STRONG>fzn_ic</STRONG></A></DT>
<DD>Mapping from FlatZinc to lib(ic) and lib(ic_sets)</DD>
<DT><A HREF="lib_public/grasper/index.html"><STRONG>grasper</STRONG></A></DT>
<DD>Finite Graphs Constraints Library</DD>
<DT><A HREF="lib/ic/index.html"><STRONG>ic</STRONG></A></DT>
<DD>Hybrid integer/real interval arithmetic constraint solver</DD>
<DT><A HREF="lib/ic_cumulative/index.html"><STRONG>ic_cumulative</STRONG></A></DT>
<DD>Cumulative scheduling constraint library for IC</DD>
<DT><A HREF="lib/ic_edge_finder/index.html"><STRONG>ic_edge_finder</STRONG></A></DT>
<DD>Quadratic edge-finder algorithm for disjunctive and cumulative constraints for IC</DD>
<DT><A HREF="lib/ic_edge_finder3/index.html"><STRONG>ic_edge_finder3</STRONG></A></DT>
<DD>Cubic edge-finder algorithm for disjunctive and
cumulative constraints for IC</DD>
<DT><A HREF="lib/ic_gap_sbdd/index.html"><STRONG>ic_gap_sbdd</STRONG></A></DT>
<DD>GAP-based Symmetry Breaking via Dominance Detection (SBDD)</DD>
<DT><A HREF="lib/ic_gap_sbds/index.html"><STRONG>ic_gap_sbds</STRONG></A></DT>
<DD>GAP-based Symmetry Breaking During Search (SBDS)</DD>
<DT><A HREF="lib/ic_global/index.html"><STRONG>ic_global</STRONG></A></DT>
<DD>Various global constraints over lists of IC variables</DD>
<DT><A HREF="lib_public/ic_global_gac/index.html"><STRONG>ic_global_gac</STRONG></A></DT>
<DD>Library of global constraints which achieve generalized arc consistency</DD>
<DT><A HREF="lib/ic_hybrid_sets/index.html"><STRONG>ic_hybrid_sets</STRONG></A></DT>
<DD>Solver over sets of integers (lex bounds, cooperates with lib(ic))</DD>
<DT><A HREF="lib/ic_kernel/index.html"><STRONG>ic_kernel</STRONG></A></DT>
<DD>Low-level interface to the common kernel of the IC solver</DD>
<DT><A HREF="lib/ic_make_overlap_bivs/index.html"><STRONG>ic_make_overlap_bivs</STRONG></A></DT>
<DD>Probe Search</DD>
<DT><A HREF="lib/ic_probe/index.html"><STRONG>ic_probe</STRONG></A></DT>
<DD>Probing</DD>
<DT><A HREF="lib/ic_probe_search/index.html"><STRONG>ic_probe_search</STRONG></A></DT>
<DD>Probe Search</DD>
<DT><A HREF="lib/ic_probe_support/index.html"><STRONG>ic_probe_support</STRONG></A></DT>
<DD>Probe Support Library</DD>
<DT><A HREF="lib/ic_probing_for_scheduling/index.html"><STRONG>ic_probing_for_scheduling</STRONG></A></DT>
<DD>Probing for Scheduling</DD>
<DT><A HREF="lib/ic_sbds/index.html"><STRONG>ic_sbds</STRONG></A></DT>
<DD>Symmetry Breaking During Search (SBDS)</DD>
<DT><A HREF="lib/ic_sets/index.html"><STRONG>ic_sets</STRONG></A></DT>
<DD>Solver over sets of integers (cooperates with lib(ic))</DD>
<DT><A HREF="lib/ic_symbolic/index.html"><STRONG>ic_symbolic</STRONG></A></DT>
<DD>Solver for constraints over ordered symbolic domains</DD>
<DT><A HREF="lib/make_overlap_bivs/index.html"><STRONG>make_overlap_bivs</STRONG></A></DT>
<DD>Probe Search</DD>
<DT><A HREF="lib_public/minizinc/index.html"><STRONG>minizinc</STRONG></A></DT>
<DD>Utilities for using MiniZinc with ECLiPSe</DD>
<DT><A HREF="lib/mip/index.html"><STRONG>mip</STRONG></A></DT>
<DD>An example implementing MIP-style branch-and-bound</DD>
<DT><A HREF="lib/probe/index.html"><STRONG>probe</STRONG></A></DT>
<DD>Probing</DD>
<DT><A HREF="lib/probe_search/index.html"><STRONG>probe_search</STRONG></A></DT>
<DD>Probe Search</DD>
<DT><A HREF="lib/probe_support/index.html"><STRONG>probe_support</STRONG></A></DT>
<DD>Probe Support Library</DD>
<DT><A HREF="lib/probing_for_scheduling/index.html"><STRONG>probing_for_scheduling</STRONG></A></DT>
<DD>Probing for Scheduling</DD>
<DT><A HREF="lib/propia/index.html"><STRONG>propia</STRONG></A></DT>
<DD>The Generalised Propagation Library</DD>
<DT><A HREF="lib/repair/index.html"><STRONG>repair</STRONG></A></DT>
<DD>Repair library: support for local search via tentative assignments and repair constraints</DD>
<DT><A HREF="lib/sd/index.html"><STRONG>sd</STRONG></A></DT>
<DD>Simple solver for constraints over unordered symbolic domains</DD>
<DT><A HREF="lib/shadow_cons/index.html"><STRONG>shadow_cons</STRONG></A></DT>
<DD>A library implementing shadow, or 'local', constraint stores</DD>
<DT><A HREF="lib/suspend/index.html"><STRONG>suspend</STRONG></A></DT>
<DD>Lazy-checking versions of arithmetic primitives, and the suspend-attribute</DD>
<DT><A HREF="lib/sym_expr/index.html"><STRONG>sym_expr</STRONG></A></DT>
<DD>Library for expressing the symmetries of a CSP</DD>
<DT><A HREF="lib/tentative/index.html"><STRONG>tentative</STRONG></A></DT>
<DD>A framework for Local Search based on tentative values</DD>
<DT><A HREF="lib/tentative_constraints/index.html"><STRONG>tentative_constraints</STRONG></A></DT>
<DD>Tentative value implementations for some basic constraints</DD>
</DL>
<HR>Generated 2009-05-27 01:25
</BODY></HTML>
